Permutation Generation: Two New Permutation Algorithms

摘要

Two completely new algorithms for generating permutations, shift-cursoralgorithm and level algorithm, and their efficient implementations arepresented in this paper. One implementation of the shift cursor algorithm givesan optimal solution of the permutation generation problem, and oneimplementation of the level algorithm can be used to generate randompermutations.